Numerical Analysis for layout methods on h-shaped double row piles
نویسندگان
چکیده
منابع مشابه
The double row layout problem
This research explores the double row layout problem (DRLP) that deals with how to place departments or machines on both sides of a central corridor. This type of layout problem is commonly observed in production and service facilities. Over the last 40 years, researchers have extensively studied a similar problem called the single row layout problem (SRLP) or one dimensional space allocation p...
متن کاملAn Extended Double Row Layout Problem
The double row layout problem (DRLP) seeks to determine optimal machine locations on either side of an aisle, where the objective has been defined as the minimization of material flow cost among machines while meeting machine clearance constraints. In this paper, we extend existing DRLP formulations in two respects. First, we consider the minimization of layout area besides the usual material f...
متن کاملSingle-Row Equidistant Facility Layout as a Special Case of Single-Row Facility Layout
In this paper we discuss two particular layout problems, namely the Single-Row Equidistant Facility Layout Problem (SREFLP) and the Single-Row Facility Layout Problem (SRFLP). Our aim is to consolidate the two respective branches in the layout literature. We show that the (SREFLP) is not only a special case of the Quadratic Assignment Problem but also a special case of the (SRFLP). This new con...
متن کاملNumerical Analysis of Piles in Layered Soils: A Parametric Study
In this paper, numerical analysis of a pile-soil interaction problem is presented considering the parameters influencing the axial load-deformation behavior of the pile embedded in a layered soil medium. The analysis is demonstrated with parametric solutions of a pile with underlain model soil strata under the axial force. An attempt is made to ascertain the extent of influence of elastic prope...
متن کاملRow by row methods for semidefinite programming
We present a row-by-row (RBR) method for solving semidefinite programming (SDP) problem based on solving a sequence of problems obtained by restricting the n-dimensional positive semidefinite constraint on the matrix X. By fixing any (n − 1)-dimensional principal submatrix of X and using its (generalized) Schur complement, the positive semidefinite constraint is reduced to a simple second-order...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: E3S Web of Conferences
سال: 2020
ISSN: 2267-1242
DOI: 10.1051/e3sconf/202016506017